Deriving Barbed Bisimulations for Bigraphical Reactive Systems
نویسندگان
چکیده
We study the definition of a general abstract notion of barbed bisimilarity for reactive systems on bigraphs. More precisely, given a bigraphical reactive system, we define the corresponding barbs from the contextual labels given by the IPO construction, in a general and systematic way. These barbs correspond to observe which names on the interface are actually involved in reactions (and how). As examples, we apply this construction to the (bigraphical representation of the) π-calculus and of Mobile Ambients, and compare the resulting barbed equivalences with those previously known for these calculi.
منابع مشابه
Semantics of Higher-Order Mobile Embedded Resources and Local Names
This PhD dissertation develops a formal model and theory for reasoning about mobile and distributed systems. In particular, we consider systems consisting of mobile computing devices containing mobile computations, where both kinds of entities can move between locations and where the entities can contain local information. We begin by presenting a process calculus that focuses on the following ...
متن کاملDirected Bigraphs : Theory and Applications ∗ Davide Grohmann Marino
We introduce directed bigraphs, a bigraphical meta-model for describing computational paradigms dealing with locations and resource communications. Directed bigraphs subsume and generalize both original Milner’s and Sassone-Sobociński’s variants of bigraphs. The key novelty is that directed bigraphs take account of the “resource request flow” inside link graphs, from controls to edges (through ...
متن کاملDirected Bigraphs
We introduce directed bigraphs, a bigraphical meta-model for describing computational paradigms dealing with locations and resource communications. Directed bigraphs subsume and generalize both original Milner’s and Sassone-Sobociński’s variants of bigraphs. The key novelty is that directed bigraphs take account of the “resource request flow” inside link graphs, from controls to edges (through ...
متن کاملOn the Construction of Sorted Bigraphical Reactive Systems
We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. Here we present a general construction of sortings for bigraphical reactive systems; a construct...
متن کاملOn Barbs and Labels in Reactive Systems
Reactive systems (RSs) represent a meta-framework aimed at deriving behavioral congruences for those computational formalisms whose operational semantics is provided by reduction rules. RSs proved a flexible specification device, yet so far most of the efforts dealing with their behavioural semantics focused on idem pushouts (IPOs) and saturated (also known as dynamic) bisimulations. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ECEASST
دوره 16 شماره
صفحات -
تاریخ انتشار 2008